HiTrust: building cross-organizational trust relationship based on a hybrid negotiation tree

Small-world phenomena have been observed in existing peer-to-peer (P2P) networks which has proved useful in the design of P2P file-sharing systems. Most studies of constructing small world behaviours on P2P are based on the concept of clustering peer nodes into groups, communities, or clusters. However, managing additional multilayer topology increases maintenance overhead, especially in highly dynamic environments. In this paper, we present Social-like P2P systems (Social-P2Ps) for object discovery by self-managing P2P topology with human tactics in social networks. In Social-P2Ps, queries are routed intelligently even with limited cached knowledge and node connections. Unlike community-based P2P file-sharing systems, we do not intend to create and maintain peer groups or communities consciously. In contrast, each node connects to other peer nodes with the same interests spontaneously by the result of daily searches

A model for inter-module analysis and optimizing compilation

Recent research into the implementation of logic programming languages has demonstrated that global program analysis can be used to speed up execution by an order of magnitude. However, currently such global program analysis requires the program to be analysed as a whole: sepárate compilation of modules is not supported. We describe and empirically evalúate a simple model for extending global program analysis to support sepárate compilation of modules. Importantly, our model supports context-sensitive program analysis and multi-variant specialization of procedures in the modules

Independence in CLP Languages

Studying independence of goals has proven very useful in the context of logic programming. In particular, it has provided a formal basis for powerful automatic parallelization tools, since independence ensures that two goals may be evaluated in parallel while preserving correctness and eciency. We extend the concept of independence to constraint logic programs (CLP) and prove that it also ensures the correctness and eciency of the parallel evaluation of independent goals. Independence for CLP languages is more complex than for logic programming as search space preservation is necessary but no longer sucient for ensuring correctness and eciency. Two additional issues arise. The rst is that the cost of constraint solving may depend upon the order constraints are encountered. The second is the need to handle dynamic scheduling. We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow dierent optimizations, from parallelism to intelligent backtracking. Sucient conditions for independence which can be evaluated \a priori" at run-time are also proposed. Our study also yields new insights into independence in logic programming languages. In particular, we show that search space preservation is not only a sucient but also a necessary condition for ensuring correctness and eciency of parallel execution

Improving the compilation of prolog to C using moded types and determinism information

We describe the current status of and provide performance results for a prototype compiler of Prolog to C, ciaocc. ciaocc is novel in that it is designed to accept different kinds of high-level information, typically obtained via an automatic analysis of the initial Prolog program and expressed in a standardized language of assertions. This information is used to optimize the resulting C code, which is then processed by an off-the-shelf C compiler. The basic translation process essentially mimics the unfolding of a bytecode emulator with respect to the particular bytecode corresponding to the Prolog program. This is facilitated by a flexible design of the instructions and their lower-level components. This approach allows reusing a sizable amount of the machinery of the bytecode emulator: predicates already written in C, data definitions, memory management routines and áreas, etc., as well as mixing emulated bytecode with native code in a relatively straightforward way. We report on the performance of programs compiled by the current versión of the system, both with and without analysis information

Multi-mode Flight Sliding Mode Control System for a Quadrotor

There is a wide range of applications for unmanned aerial vehicles that requires the capability of having several and robust flight controllers available. This paper presents the main framework of a multimode flight control system for a quadrotor based on the super twisting control algorithm. The design stages for the four flight control modes encompassing manual, altitude, GPS fixed and autonomous mode are presented. The stability proof for each flight mode is carried out by means of Lyapunov functions while the stability analysis for the complete system, when a transition from one mode to another occurs, is demonstrated using the switching nonlinear systems theory. The performance of the proposed framework is demonstrated in a simulation study taking into account external disturbances

Prokaryotic and Eukaryotic Community Structure in Field and Cultured Microbialites from the Alkaline Lake Alchichica (Mexico)

The geomicrobiology of crater lake microbialites remains largely unknown despite their evolutionary interest due to their resemblance to some Archaean analogs in the dominance of in situ carbonate precipitation over accretion. Here, we studied the diversity of archaea, bacteria and protists in microbialites of the alkaline Lake Alchichica from both field samples collected along a depth gradient (0–14 m depth) and long-term-maintained laboratory aquaria. Using small subunit (SSU) rRNA gene libraries and fingerprinting methods, we detected a wide diversity of bacteria and protists contrasting with a minor fraction of archaea. Oxygenic photosynthesizers were dominated by cyanobacteria, green algae and diatoms. Cyanobacterial diversity varied with depth, Oscillatoriales dominating shallow and intermediate microbialites and Pleurocapsales the deepest samples. The early-branching Gloeobacterales represented significant proportions in aquaria microbialites. Anoxygenic photosynthesizers were also diverse, comprising members of Alphaproteobacteria and Chloroflexi. Although photosynthetic microorganisms dominated in biomass, heterotrophic lineages were more diverse. We detected members of up to 21 bacterial phyla or candidate divisions, including lineages possibly involved in microbialite formation, such as sulfate-reducing Deltaproteobacteria but also Firmicutes and very diverse taxa likely able to degrade complex polymeric substances, such as Planctomycetales, Bacteroidetes and Verrucomicrobia. Heterotrophic eukaryotes were dominated by Fungi (including members of the basal Rozellida or Cryptomycota), Choanoflagellida, Nucleariida, Amoebozoa, Alveolata and Stramenopiles. The diversity and relative abundance of many eukaryotic lineages suggest an unforeseen role for protists in microbialite ecology. Many lineages from lake microbialites were successfully maintained in aquaria. Interestingly, the diversity detected in aquarium microbialites was higher than in field samples, possibly due to more stable and favorable laboratory conditions. The maintenance of highly diverse natural microbialites in laboratory aquaria holds promise to study the role of different metabolisms in the formation of these structures under controlled conditions

The quotient of an abstract interpretation

AbstractWithin the abstract interpretation framework, abstract domains are used to represent interesting properties of the concrete domain. For instance, properties that enhance the optimization of the analyzed programs. An abstract domain D expresses, in general, several properties of the concrete domain.We describe a method for identifying, for any abstract domain D and for each property P expressed by D, the subset of D that is useful for computing P-information. We call it the quotient of D with respect to P. We also give a necessary and sufficient condition for having that the quotient is an abstraction of D. This property seems essential for applications such as that described below.As an illustration of the usefulness of the notion of quotient, we show that rather sophisticated comparisons between domains, can be carried out using it. Assume to have two abstract domains that both compute some property P, but that also express distinct properties and thus are incomparable as a whole. Such domains can be compared with respect to the precision with which they compute P-information, by comparing their quotients with respect to P.Using this method, two well-known abstract domains for Prolog programs, Prop and Sharing, are compared with respect to the precision with which they compute groundness information

Efficient Analysis of Concurrent Constraint Logic Programs

The standard operational semantics of concurrent constraint logic languages is not confluent in the sense that different schedulings of processes may result in different program behaviors. While implementations are free to choose specific scheduling policies, analyses should be correct for all implementations. Moreover, in the presence of parallelism it is usually not possible to determine how processes will actually be scheduled. Efficient program analysis is therefore difficult as all process schedulings must be cousidered. To overcome this problem we introduce a confluent semantics which closely approximates the standard (non-confluent) semantics. This semantics provides a basis for efficient and accurate program analysis for these languages. To illustrate the usefulness of this approach we sketch analyses based on abstract interpretations of the confluent semantics which determine if a program is suspension and local suspension free. © Springer-Verlag Berlin Heidelberg 1993